Fast deterministic algorithm for EEE components classification
نویسندگان
چکیده
منابع مشابه
Greedy heuristic algorithm for solving series of eee components classification problems
Algorithms based on using the agglomerative greedy heuristics demonstrate precise and stable results for clustering problems based on kmeans and p-median models. Such algorithms are successfully implemented in the processes of production of specialized EEE components for using in space systems which include testing each EEE device and detection of homogeneous production batches of the EEE compo...
متن کاملA Fast+practical+deterministic Algorithm for Triangularizing Integer Matrices
This paper presents a new algorithm for computing the row reduced echelon form triangularization H of an n m integer input matrix A. The cost of the algorithm is O(nmr 2 log 2 rjjAjj + r 4 log 3 rjjAjj) bit operations where r is the rank of A and jjAjj = max ij jA ij j. This complexity result assumes standard (quadratic) integer arithmetic but still matches, in the paramaters n, m and r, the be...
متن کاملClassification by ALH-Fast Algorithm
The adaptive local hyperplane (ALH) algorithm is a very recently proposed classifier, which has been shown to perform better than many other benchmarking classifiers including support vector machine (SVM), K-nearest neighbor (KNN), linear discriminant analysis (LDA), and K-local hyperplane distance nearest neighbor (HKNN) algorithms. Although the ALH algorithm is well formulated and despite the...
متن کاملFast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets
Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...
متن کاملA fast deterministic smallest enclosing disk approximation algorithm
We describe a simple and fast O(n log2 1 ε )-time algorithm for finding a (1 + ε)-approximation of the smallest enclosing disk of a planar set of n points or disks. Experimental results of a readily available implementation are presented. 2004 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2015
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/94/1/012015